A Multi-Job Load Sharing Strategy for Divisible Jobs on Bus Networks
نویسندگان
چکیده
In this paper, a load sharing problem involving the optimal load allocation of very long linear data files over N processors interconnected in a bus-oriented network is investigated. Two distinct types of bus networks are examined in the case when there is more than one such outstanding divisible job in the network. These are a network with load origination at a control processor and a network with load origination at a computing processor. In both cases, it is assumed that each processor is equipped with a front-end processor for communications off-loading. It is found that a multijob scheme outperforms a single-job scheme in terms of the total solution finish time. Closed form solutions and simple recursive algorithms for the determination of the optimal load allocation are also presented. &y : Greek letter alpha with hat, subscript English letter small i, superscript English letter small m a7 : Greek letter alpha, subscript English letter small i, superscript English letter small m Z : English letter capital Z wi : English letter small w, subscript English letter small i T : English letter capital T, subscript English letter small c and m, superscript English letter small m T : English letter capital T, subscript English letter small c and p, superscript English letter small m TT : English letter capital T, subscript English letter small f, superscript English letter small m k;: English letter small k, subscript English letter small i I'i: Greek letter capital Gamma, subscript English letter small i u:: English letter small u, subscript English letter small n, superscript English letter small m v,": English letter small v, subscript English letter small n, superscript English letter small m
منابع مشابه
STATE UNIVERSITY OF NEW YORK AT STONY BROOK CEAS TECHNICAL REPORG Optimal Load Sharing for a Divisible Job on a Bus Network
Optimal load allocation for load sharing a divisible job over N processors interconnected in bus-oriented network is considered. The processors are equipped with front-end processox:s. It is analytically proved, for the first time, that a minimal solution time is achieved when the computation by each processor finishes at the same time. Closed form solutions for the minimum finish time and the ...
متن کاملOptimal Location and Sizing of Distributed Generations in Distribution Networks Considering Load Growth using Modified Multi-objective Teaching Learning Based Optimization Algorithm
Abstract: This paper presents a modified method based on teaching learning based optimization algorithm to solve the problem of the single- and multi-objective optimal location of distributed generation units to cope up the load growth in the distribution network .Minimizing losses, voltage deviation, energy cost and improved voltage stability are the objective functions in this problem. Load g...
متن کاملDC Voltage Control and Power-Sharing of Multi-Terminal DC Grids Based on Optimal DC Power Flow and Flexible Voltage Droop Strategy
This paper develops an effective control framework for DC voltage control and power-sharing of multi-terminal DC (MTDC) grids based on an optimal power flow (OPF) procedure and the voltage-droop control. In the proposed approach, an OPF algorithm is executed at the secondary level to find optimal reference of DC voltages and active powers of all voltage-regulating converters. Then, the voltage ...
متن کاملGrid Scheduling Divisible Loads from Multiple Sources via Linear Programming
To date solutions for optimal finish time and job allocation in divisible load theory are largely obtained only for network topologies with a single load originating (root) processor. However in large-scale data intensive problems with geographically distributed resources, load is generated from multiple sources. This paper introduces a new divisible load scheduling strategy for tree networks w...
متن کاملAn Agent Based Dynamic Resource Scheduling Model with FCFS-Job Grouping Strategy in Grid Computing
Grid computing is a group of clusters connected over high-speed networks that involves coordinating and sharing computational power, data storage and network resources operating across dynamic and geographically dispersed locations. Resource management and job scheduling are critical tasks in grid computing. Resource selection becomes challenging due to heterogeneity and dynamic availability of...
متن کامل